Extending the Tractability Border for Closest Leaf Powers
نویسندگان
چکیده
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most ` edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff their corresponding leaves are at distance at most 4 in the tree. Complementing and “completing” previous work on Closest 2-Leaf Power and Closest 3-Leaf Power, we show that Closest 4-Leaf Power is fixed-parameter tractable with respect to parameter `.
منابع مشابه
On the numerical solution of integral equations of the fourth kind with higher index: differentiability and tractability index-3
In this paper, we consider a particular class of integral equations of the fourth kind and show that tractability and differentiability index of the given system are 3. Tractability and dierentiability index are introduced based on the-smoothing property of a Volterra integral operator and index reduction procedure, respectively. Using the notion of index, we give sucient conditions for the exi...
متن کاملOn Leaf Powers
For an integer k, a tree T is a k-leaf root of a finite simple undirected graph G = (V,E) if the set of leaves of T is the vertex set V of G and for any two vertices x, y ∈ V , x 6= y, xy ∈ E if and only if the distance of x and y in T is at most k. Then graph G is a k-leaf power if it has a k-leaf root. G is a leaf power if it is a k-leaf power for some k. This notion was introduced and studie...
متن کاملExploring the tractability border in epistemic tasks
We analyse the computational complexity of comparing informational structures. Intuitively, we study the complexity of deciding queries such as the following: Is Alice’s epistemic information strictly coarser than Bob’s? Do Alice and Bob have the same knowledge about each other’s knowledge? Is it possible to manipulate Alice in a way that she will have the same beliefs as Bob? The results show ...
متن کاملClosest 4-leaf power is fixed-parameter tractable
The NP-complete Closest 4-Leaf Power problem asks, given an undirected graph, whether it can be modified by at most r edge insertions or deletions such that it becomes a 4-leaf power. Herein, a 4-leaf power is a graph that can be constructed by considering an unrooted tree—the 4-leaf root—with leaves one-to-one labeled by the graph vertices, where we connect two graph vertices by an edge iff th...
متن کاملOn Strongly Chordal Graphs That Are Not Leaf Powers
A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V,E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv ∈ E if and only if the distance between u and v in T is at most k. Characterizing leaf powers is a challenging open problem, along with ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005